Non-blocking supervisory control under bounded time constraints based on non-deterministic timed transition models
نویسنده
چکیده
A non-blocking supervisory control problem to meet bounded time constraints for nondeterministic real-time discrete event systems (DESs) is addressed. To this end, notions of trace controllability and time controllability are introduced for the non-deterministic real-time DESs with respect to a timed language specification representing a bounded time constraint. The existence conditions of a non-blocking supervisor to achieve the timed language specification are presented on the basis of the proposed notions, and these are further illustrated by an assembly work station example.
منابع مشابه
Systematic supervisory control solutions for under-load tap-changing transformers
Discrete-event systems (DES) can be found as essential integrated subsystems in many complex systems, e.g. electrical power systems. Under-load tap-changing (ULTC) transformers which obviously have discrete-event behavior are widely used in transmission systems to take care of instantaneous variations in the load conditions in substations. In this paper, the voltage control problem in ULTC is s...
متن کاملPetri Nets as Discrete Event Models for Supervisory Control
Discrete event systems represents a new field of control theory of increasing importance in the domains of manufacturing, communications, and robotics. Supervisory Control theory, based on formal languages, is a well established framework for the study of discrete event systems. The thesis discusses the use of Petri nets in Supervisory Control. Place/Transition nets have been used by several au...
متن کاملSynchronizing Words for Weighted and Timed Automata
The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-word problems for weighted and timed automata. We consider the synchroni...
متن کاملSemantics of Timed Concurrent Systems
A truly concurrent and timeless semantics is proposed for a composition of sequential, non-deterministic processes with asynchronous communication. It is shown when this semantics differs from simple interleaving. Implementation-dependent time constraints determine a subset of all computations of the timeless semantics. This set is precisely characterized for given constraints. It is shown how ...
متن کاملNon-blocking supervisory control for initialised rectangular automata
We consider the problem of supervisory control for a class of rectangular automata and more specifically for compact rectangular automata with uniform rectangular activity, i.e. initialised. The supervisory controller is state feedback and disables discrete-event transitions in order to solve the non-blocking forbidden state problem. The non-blocking problem is defined under both strong and wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006